Definability and Fast Quantifier Elimination in Algebraically Closed Fields
نویسنده
چکیده
The Bezout-Inequality, an afine version (not in&ding multiplicities) of the classical Bezout-Theorem is derived for applications in algebraic complexity theory. Upper hounds for the cardinality and number of sets definable by first order formulas over algebraically closed fields are given. This is used for fast quantifier elimination in algebraically closed fields.
منابع مشابه
Quantifier Elimination following Muchnik
This paper describes a very simple (high school level) algorithm of quantifier elimination for real closed fields and algebraically closed fields following an idea of A. Muchnik. The algorithm essentially relies on intermediate value property, pseudo-euclidean division and sign change table for univariate polynomials over R. Surprisingly this algorithm exhibits some more general feature and it ...
متن کاملQuantifier elimination for the theory of algebraically closed valued fields with analytic structure
The theory of algebraically closed non-Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper and which has far reaching consequences in the geometry of definable sets. This method of proving quantifier ...
متن کامل2010 Summer Course on Model Theory Pete
Introduction 1 0.1. Some theorems in mathematics with snappy model-theoretic proofs 1 1. Languages, structures, sentences and theories 1 1.1. Languages 1 1.2. Statements and Formulas 4 1.3. Satisfaction 5 1.4. Elementary equivalence 6 1.5. Theories 7 2. Big Theorems: Completeness, Compactness and Löwenheim-Skolem 9 2.1. The Completeness Theorem 9 2.2. Proof-theoretic consequences of the complet...
متن کامل2010 Summer Course on Model Theory
Introduction 2 0.1. Some theorems in mathematics with snappy model-theoretic proofs 2 1. Languages, structures, sentences and theories 2 1.1. Languages 2 1.2. Statements and Formulas 5 1.3. Satisfaction 6 1.4. Elementary equivalence 7 1.5. Theories 8 2. Big Theorems: Completeness, Compactness and Löwenheim-Skolem 9 2.1. The Completeness Theorem 9 2.2. Proof-theoretic consequences of the complet...
متن کاملUnderstanding Algebro-Geometric Quantifier Elimination: Part I, Algebraically Closed Fields of Characteristic Zero via Muchnik
In this short expository note, we present a self-contained proof that algebraically closed fields of characteristic zero admit elimination of quantifiers over the elementary language of rings. We do this by fleshing out a method due to Muchnik1 (and possibly Cohen2). This note is the first part of a series on algebro-geometric quantifier elimination: the next note shall use much of the machiner...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 24 شماره
صفحات -
تاریخ انتشار 1983